Linear programming relaxations of maxcut
نویسندگان
چکیده
It is well-known that the integrality gap of the usual linear programming relaxation for Maxcut is 2 − ǫ. For general graphs, we prove that for any ǫ and any fixed boundk, adding linear constraints of support bounded by k does not reduce the gap below 2−ǫ. We generalize this to prove that for any ǫ and any fixed bound k, strengthening the usual linear programming relaxation by doing k rounds of Sherali-Adams liftand-project does not reduce the gap below 2− ǫ. On the other hand, we prove that for dense graphs, this gap drops to 1 + ǫ after adding all linear constraints of support bounded by some constant depending on ǫ.
منابع مشابه
1 Parallel Semidefinite Programming and Combinatorial Optimization STEVEN
The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing. Solution techniques for minimizing combinatorial probl...
متن کاملApproximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
Semidefinite relaxations of certain combinatorial optimization problems lead to approximation algorithms with performance guarantees. For large-scale problems, it may not be computationally feasible to solve the semidefinite relaxations to optimality. In this paper, we investigate the effect on the performance guarantees of an approximate solution to the semidefinite relaxation for MaxCut, Max2...
متن کاملAdvanced Optimization Laboratory Title : A semidefinite programming based polyhedral cut and price approach for the maxcut problem
We investigate solution of the maximum cut problem using a polyhedral cut and price approach. The dual of the well-known SDP relaxation of maxcut is formulated as a semi-infinite linear programming problem, which is solved within an interior point cutting plane algorithm in a dual setting; this constitutes the pricing (column generation) phase of the algorithm. Cutting planes based on the polyh...
متن کاملTitle: a Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem a Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem
We investigate solution of the maximum cut problem using a polyhedral cut and price approach. The dual of the well-known SDP relaxation of maxcut is formulated as a semi-infinite linear programming problem, which is solved within an interior point cutting plane algorithm in a dual setting; this constitutes the pricing (column generation) phase of the algorithm. Cutting planes based on the polyh...
متن کاملApproximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring
We describe the semidefinite analog of the vector packing problem, and show that the semidefinite programming relaxations for Maxcut [10] and graph coloring [16] are in this class of problems. We extend a method of Bienstock and Iyengar [4] which was based on ideas from Nesterov [24] to design an algorithm for computing 2-approximate solutions for this class of semidefinite programs. Our algori...
متن کامل